An Urn Model of Diaconis
نویسندگان
چکیده
SUMMARY An urn model of Diaconis and some generalizations are discussed. A convergence theorem is proved that implies for Diaconis' model that the empirical distribution of balls in the urn converges with probability one to the uniform distribution.
منابع مشابه
2 00 4 Random Multiplication Approaches Uniform Measure in Finite Groups
In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random with replacement and a ball labeled with the group product (in the order they were picked) is added to the urn. We give a proof of his conjecture that the l...
متن کاملHoeffding Decompositions and Two-Colour Urn Sequences
Let X = (X1, X2, ...) be a non-deterministic infinite exchangeable sequence with values in {0, 1}. We show that X is Hoeffding-decomposable if, and only if, X is either an i.i.d. sequence or a Pólya sequence. This completes the results established in Peccati [2004]. The proof uses several combinatorial implications of the correspondence between Hoeffding decomposability and weak independence. O...
متن کاملP´olya-Type Urn Models with Multiple Drawings
We investigate the distribution, mean value, variance and some limiting properties of an urn model of white and red balls under random multiple drawing (either with or without replacement) when the number of white and red balls added follows a schedule that depends on the number of white balls chosen in each drawing.
متن کاملThe mathematics of mixing things up
How long should a Markov chain Monte Carlo algorithm be run? Using examples from statistical physics (Ehrenfest urn, Ising model, hard discs) as well as card shuffling, this tutorial paper gives an overview of a body of mathematical results that can give useful answers to practitioners (viz: seven shuffles suffice for practical purposes). It points to new techniques (path coupling, geometric in...
متن کاملTHE MATHEMATICS OF MIXING THINGS UP By
How long should a Markov chain Monte Carlo algorithm be run? Using examples from statistical physics (Ehrenfest urn, Ising model, hard discs) as well as card shuffling, this tutorial paper gives an overview of a body of mathematical results that can give useful answers to practitioners (viz: seven shuffles suffice for practical purposes). It points to new techniques (path coupling, geometric in...
متن کامل